Packing 16, 17 or 18 circles in an equilateral triangle
نویسندگان
چکیده
We present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral triangle. The results have been found by the use of simulated annealing and a quasi-Newton optimization technique, supplemented with some human intelligence.
منابع مشابه
Packing up to 50 Equal Circles in a Square
The Hungarian mathematician Farkas Bolyai (1775–1856) published in his principal work (‘Tentamen’, 1832–33 [Bol04]) a dense regular packing of equal circles in an equilateral triangle (see Fig. 1). He defined an infinite packing series and investigated the limit of vacuitas (in Latin, the gap in the triangle outside the circles). It is interesting that these packings are not always optimal in s...
متن کاملDense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond
Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 disks. We use a new discrete-event simulation algorithm to produce packings for up to 34 disks. For each n in the range 22 ≤ n ≤ 34 we present what we believe to be the densest possible packing of n equal disks in an equilateral triangle. For these n we also list the second, often the third and some...
متن کاملPacking and Covering a Unit Equilateral Triangle with Equilateral Triangles
Packing and covering are elementary but very important in combinatorial geometry , they have great practical and theoretical significance. In this paper, we discuss a problem on packing and covering a unit equilateral triangle with smaller triangles which is originated from one of Erd˝ os' favorite problems.
متن کاملNP-Hard Triangle Packing Problems
In computational geometry, packing problems ask whether a set of rigid pieces can be placed inside a target region such that no two pieces overlap. The triangle packing problem is a packing problem that involves triangular pieces, and it is crucial for algorithm design in many areas, including origami design, cutting industries, and warehousing. Previous works in packing algorithms have conject...
متن کاملThe Dense Packing of 13 Congruent Circles in a Circle
The densest packings of n congruent circles in a circle are known for n 12 and n = 19. In this paper we exhibit the densest packings of 13 congruent circles in a circle. We show that the optimal con gurations are identical to Kravitz's [11] conjecture. We use a technique developed from a method of Bateman and Erd}os [1] which proved fruitful in investigating the cases n = 12 and 19 by the autho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 145 شماره
صفحات -
تاریخ انتشار 1995